Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers
نویسندگان
چکیده
1 Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada email: {[email protected], [email protected]} 2 School of Mathematics and Statistics, Carleton University, Ottawa, Ontario K1S 5B6, Canada email: {[email protected], [email protected]} 3 Department of Mathematics, University of California Davis, Davis, California 95616, United States of America email: {[email protected]}
منابع مشابه
Average-case Analysis of Two Revocation Schemes for Stateless Receivers
We consider the mean and variance of the number of encryptions necessary over all subsets of privileged users to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes. Park and Blake in: Journal of Discrete Algorithms, vol. 4, 2006, pp. 215–238 [4], give the mean number of encryptions for th...
متن کاملAn Efficient Revocation Scheme for Stateless Receiver with Less Encryption and Less Key Storage
In the revocation scheme for stateless receivers, the center delivers information securely to the authorized users over a public channel, where the receivers do not update their state from session to session. This paper presents a view of multimedia Conditional Access Systems (CAS) one-way broadcasting and suggests a new approach. The proposed approach is an efficient revocation scheme for stat...
متن کاملThe Interval Revocation Scheme for Broadcasting Messages to Stateless Receivers
The Broadcast Encryption methods, often referred to as revocation schemes, allow data to be efficiently broadcast to a dynamically changing group of users. A special case is when the receivers are stateless [2, 1]. Naor et al. [2] propose the Complete Subset Method (CSM) and the Subset Difference Method (SDM). Asano [1] puts forth two other methods, AM1 and AM2, which use public prime parameter...
متن کاملRevocation and Tracing Schemes for Stateless Receivers
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of the message. We concentrate on the stateless receiver case, where the users do not (necessarily) update their state from session to session. We present a framework called the Subset-Cover framework, which abstracts a ...
متن کاملStorage-Efficient Stateless Group Key Revocation
Secure group communication relies on secure and robust distribution of group keys. A stateless group key distribution scheme is an ideal candidate when the communication channel is unreliable. Several stateless group key distribution schemes have been proposed. However, these schemes require all users store a certain number of auxiliary keys. The number of such keys increases as the group size ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008